-
1 циклический граф
circuit graph мат., cyclic graphРусско-английский научно-технический словарь Масловского > циклический граф
-
2 циклически жёсткий граф
1) Mathematics: rigid cycle graph2) Electronics: rigid circuit graphУниверсальный русско-английский словарь > циклически жёсткий граф
-
3 циклический граф
1) Engineering: cyclic graph2) Mathematics: circuit graph -
4 циклически жесткий граф
Русско-английский словарь по электронике > циклически жесткий граф
-
5 циклически жесткий граф
Русско-английский словарь по радиоэлектронике > циклически жесткий граф
-
6 теория графов
-
7 теория графов
Русско-английский новый политехнический словарь > теория графов
-
8 граф без шлейфа
граф без шлейфа
граф без цикла
—
[Л.Г.Суменко. Англо-русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.]Тематики
Синонимы
EN
Русско-английский словарь нормативно-технической терминологии > граф без шлейфа
-
9 связный граф
circuit connected graph, connected graph -
10 связный граф
circuit connected graph, connected graphРусско-английский словарь по радиоэлектронике > связный граф
-
11 граф без циклов
circuit-free graph мат., circuitless graphРусско-английский научно-технический словарь Масловского > граф без циклов
-
12 граф без циклов
-
13 цикл графа
-
14 циклически замкнутый граф
Русско-английский словарь по электронике > циклически замкнутый граф
-
15 граф без циклов
Русско-английский словарь по радиоэлектронике > граф без циклов
-
16 цикл графа
-
17 циклически замкнутый граф
Русско-английский словарь по радиоэлектронике > циклически замкнутый граф
-
18 граф без циклов
Русско-английский словарь по вычислительной технике и программированию > граф без циклов
-
19 циклически замкнутый граф
Русско-английский научно-технический словарь Масловского > циклически замкнутый граф
-
20 циклически симметричный граф
Русско-английский научно-технический словарь Масловского > циклически симметричный граф
См. также в других словарях:
Circuit — may mean: In science and technology Circuit theory, the theory of accomplishing work by routing electrons, gas, fluids, or other matter through a loop Pneumatic circuit Hydraulic circuit Boolean circuit circuit (computer theory) Integer circuit a … Wikipedia
graph theory — Math. the branch of mathematics dealing with linear graphs. [1965 70] * * * Mathematical theory of networks. A graph consists of nodes (also called points or vertices) and edges (lines) connecting certain pairs of nodes. An edge that connects a… … Universalium
Circuit complexity — In theoretical computer science, circuit complexity is a branch of computational complexity theory in which Boolean functions are classified according to the size or depth of Boolean circuits that compute them. A Boolean circuit with n input bits … Wikipedia
Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and … Wikipedia
Graph (mathematics) — This article is about sets of vertices connected by edges. For graphs of mathematical functions, see Graph of a function. For statistical graphs, see Chart. Further information: Graph theory A drawing of a labeled graph on 6 vertices and 7 edges … Wikipedia
Graph isomorphism — In graph theory, an isomorphism of graphs G and H is a bijection between the vertex sets of G and H such that any two vertices u and v of G are adjacent in G if and only if ƒ(u) and ƒ(v) are adjacent in H. This kind of bijection is commonly… … Wikipedia
Circuit rank — The circuit rank of a graph G (also known as the cyclomatic number of G) is the minimum number r of edges to remove from the graph to make it cycle free. It has the formula r = m − n + c, where m is the number |E(G)| of edges in G, n is the… … Wikipedia
Circuit (computer theory) — A circuit in computer theory is a theoretical structure simulating electrical and data paths, in which voltage and binary values enter at the beginning of the circuit, go through gates which do some computation and output an answer. An important… … Wikipedia
Graph acyclique — Graphe acyclique Un graphe acyclique est un graphe ne contenant aucun cycle. Ce terme concerne les graphes orientés puisque les graphes non orienté sans cycle sont les forêts (chaque composante connexe est un arbre). Afin de distinguer les cycles … Wikipédia en Français
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
Signal-flow graph — A signal flow graph (SFG) is a special type of block diagram[1] and directed graph consisting of nodes and branches. Its nodes are the variables of a set of linear algebraic relations. An SFG can only represent multiplications and additions.… … Wikipedia